#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],sum[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n,s;cin>>n>>s;
      for(LL i=0;i<=n+10;i++) sum[i]=0,a[i]=0;
      for(LL i=1;i<=n;i++) cin>>a[i];
      for(LL i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
      LL pos=0;LL mx=-1;LL ans=0;
      bool flag=1;
      for(LL i=1;i<=n;i++){
          if(mx<a[i]){
             mx=a[i];
             pos=i;
          }
          if(sum[i]-sum[0]<=s){
             continue;
          }
          else{
             if(flag){
                s+=mx;
                ans=pos;
                flag=0;
             }
             else{
                break;
             }
          }
      }
      if(flag==0) cout<<ans<<"\n";
      else cout<<"0"<<"\n";
   }
   return 0;
}
